Recurrence relations for polynomial sequences via Riordan matrices
نویسندگان
چکیده
منابع مشابه
Recurrence Relations for Polynomial Sequences via Riordan Matrices
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence ...
متن کاملSome recurrence relations for binary sequence matrices
This note compares and contrasts some properties of binary sequences with matrices and associated recurrence relations in order to stimulate some enrichment exercises and pattern puzzles.
متن کاملThe Characterization of Riordan Arrays and Sheffer-type Polynomial Sequences
Here we present a characterization of Sheffer-type polynomial sequences based on the isomorphism between the Riordan group and Sheffer group and the sequence characterization of Riordan arrays. We also give several alternative forms of the characterization of the Riordan group, Sheffer group and their subgroups. Formulas for the computation of the generating functions of Riordan arrays and Shef...
متن کاملEfficiently determining Convergence in Polynomial Recurrence Sequences
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approa...
متن کاملRecurrence Relations and Splitting Formulas for the Domination Polynomial
The domination polynomial D(G, x) of a graph G is the generating function of its dominating sets. We prove that D(G, x) satisfies a wide range of reduction formulas. We show linear recurrence relations for D(G, x) for arbitrary graphs and for various special cases. We give splitting formulas for D(G, x) based on articulation vertices, and more generally, on splitting sets of vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.05.021